Edge-tenacity in Networks
author
Abstract:
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the "Tenacity" and "Edge-tenacity" of a graph. In this paper we present results on the tenacity and edge-tenacity, $T_e(G)$, a new invariant, for several classes of graphs. Basic properties and some bounds for edge-tenacity, $T_e(G)$, are developed. Edge-tenacity values for various classes of graphs are calculated and future work andconcluding remarks are summarized
similar resources
The edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
full textOn the Edge-Tenacity of Graphs
The edge-tenacity Te(G) of a graph G was defined as Te(G) = min F⊂E(G) {| F | +τ(G− F ) ω(G− F ) } where the minimum is taken over all edge cutset F of G. We define G-F to be the graph induced by the edges of E(G) − F , τ(G − F ) is the number of edges in the largest component of the graph induced by G-F and ω(G−F ) is the number of components of G− F . A set F ⊂ E(G) is said to be a Te-set of ...
full textthe edge tenacity of a split graph
the edge tenacity te(g) of a graph g is de ned as:te(g) = min {[|x|+τ(g-x)]/[ω(g-x)-1]|x ⊆ e(g) and ω(g-x) > 1} where the minimum is taken over every edge-cutset x that separates g into ω(g - x) components, and by τ(g - x) we denote the order of a largest component of g. the objective of this paper is to determine this quantity for split graphs. let g = (z; i; e) be a noncomplete connected spli...
full textSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
full textUse dependence of presynaptic tenacity.
Recent studies indicate that synaptic vesicles (SVs) are continuously interchanged among nearby synapses at very significant rates. These dynamics and the lack of obvious barriers confining synaptic vesicles to specific synapses would seem to challenge the ability of synapses to maintain a constant amount of synaptic vesicles over prolonged time scales. Moreover, the extensive mobilization of s...
full textTenacity of avian influenza viruses.
The goal of this review is to provide an overview of existing research on the environmental tenacity of avian influenza (AI) viruses, to identify gaps in our current understanding, and discuss how this information relates to AI control, eradication, and prevention. We are just beginning to understand the environmental factors that affect infectivity and the extent of variation in environmental ...
full textMy Resources
Journal title
volume 49 issue 1
pages 45- 53
publication date 2017-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023